An Incremental LL(1) Parsing Algorithm
نویسنده
چکیده
Given a parse tree for a sentence xzy and a string Z, an incremental parser builds the parse tree for the sentence xZy by reusing as much of the parse tree for xzy as possible. The incremental LL(1) parsing algorithm in this paper makes use of a break-point table to identify reusable subtrees of the original parse tree in building the new parse tree. The break-point table may be computed from the grammar.
منابع مشابه
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structure similar to dependency links which is well-suited for incremental parsing. In contrast to previous unsupervised parsers, the parser does not use part-of-speech tags and both learning and parsing are local and fast, re...
متن کاملComputer Systems Laeoratory
This paper describes a new algorithm for top-down parsing of general context-free grammars. The algorithm does not require any changes to be made to the grammar, and can parse with respect to any grammar non-terminal as the start symbol. It is possible to generate all possible parse trees of the input string in the presence of ambiguous grammars. The algorithm reduces to recursive descent parsi...
متن کاملAn Incremental LR Parse Strategy for Language - Based EditorsPhil
We present an incremental parser for a modeless syntax recognising language-based editor. The strategy we describe has been implemented as part of the UQ? generic language-based environment. Incremental parsing in the UQ? editor has previously been based on LL techniques. The incremen-tal LR parser described in this report has been developed to allow manipulation of a larger class of languages ...
متن کاملUnifying LL and LR parsing
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper the relation between these methods is cla-riied. As shown in literature on parsing theory, for every context-free grammar, a so-called non-deterministic LR(0) automaton can be constructed. Here, we show, that traversing this automaton in a special way is equivalent to LL(1) parsing. This automato...
متن کاملEfficiency considerations for LFG-parsers - incremental and table-lookup techniques
I s tv£n B£tori and Stefan Marok FB 2 Linguis t ics E W H Rhein land-Pfa lz , l~heinun 3-4, D-5400 Koblenz~ F R G The paper presents a concise description of the LFG-ParserGenerator developed at the EWH in Koblenz. Special attention is paid to efficiency considerations to speed up the system in the execution phase. Lexicon is separated, ll(k)-parsing tables are used and some preliminary ratific...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 48 شماره
صفحات -
تاریخ انتشار 1993